Multicolor and directed edit distance
نویسندگان
چکیده
منابع مشابه
Multicolor and Directed Edit Distance
The editing of a combinatorial object is the alteration of some of its elements such that the resulting object satisfies a certain fixed property. The edit problem for graphs, when the edges are added or deleted, was first studied independently by the authors and Kézdy [J. Graph Theory (2008) 58(2), 123–138] and by Alon and Stav [Random Structures Algorithms (2008) 33(1), 87–104]. In this paper...
متن کاملMap Edit Distance vs. Graph Edit Distance for Matching Images
Generalized maps are widely used to model the topology of nD objects (such as 2D or 3D images) by means of incidence and adjacency relationships between cells (0D vertices, 1D edges, 2D faces, 3D volumes, ...). We have introduced in [1] a map edit distance. This distance compares maps by means of a minimum cost sequence of edit operations that should be performed to transform a map into another...
متن کاملTree Edit Distance, Alignment Distance and Inclusion
We survey the problem of comparing labeled trees based on simple local operations of deleting, inserting and relabeling nodes. These operations lead to the tree edit distance, alignment distance and inclusion problem. For each problem we review the results available and present, in detail, one or more of the central algorithms for solving the problem.
متن کاملEdit Distance and its Computation
In this paper, we provide a method for determining the asymptotic value of the maximum edit distance from a given hereditary property. This method permits the edit distance to be computed without using Szemerédi’s Regularity Lemma directly. Using this new method, we are able to compute the edit distance from hereditary properties for which it was previously unknown. For some graphs H, the edit ...
متن کاملEdit Distance in Graphs
The focus of my research is extremal graph theory and random combinatorial structures. I have also worked in a variety of other areas, including intersecting hypergraphs, the theory of positional games and Ramsey theory. I use a number of tools in my research, notably probabilistic methods and, most prominently, Szemerédi’s regularity lemma. I have used these and other techniques to address que...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorics
سال: 2011
ISSN: 2156-3527,2150-959X
DOI: 10.4310/joc.2011.v2.n4.a4